package d2;

public class Day17 {
    public static void main(String[] args) {
        longestCommonSubsequence("abc","def");
    }
    public static int longestCommonSubsequence(String text1, String text2) {
        int m=text1.length(),n=text2.length();
        int[][] dp = new int[m+1][n+1];
        text1 = "_"+text1;
        text2 = "_"+text2;
        for(int i=1;i<m+1;i++) {
            for(int j=1;j<n+1;j++) {
                if(text1.charAt(i)==text2.charAt(j)) {
                    dp[i][j]=dp[i-1][j-1]+1;
                } else {
                    dp[i][j]=Math.max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        return dp[m][n];
    }
}
